Classifying Resolving Lists by Distances between Members
نویسندگان
چکیده
منابع مشابه
Classifying Textures when Seen from Different Distances
The purpose of this work is to analyse what happens to the surface information when the image resolution is modified. We deduce how the same surface appears if seen from different distances. Using 4-source Colour Photometric Stereo, which provides the surface shape and colour information, a method for predicting how surface texture looks like when changing the distance of the camera is presente...
متن کاملUsing Word Similarity Lists For Resolving Indirect Anaphora
In this work we test the use of word similarity lists for anaphora resolution in Portuguese corpora. We applied an automatic lexical acquisition technique over parsed texts to identify semantically similar words. After that, we made use of this lexical knowledge to resolve coreferent definite descriptions where the head-noun of the anaphor is different from the head-noun of its antecedent, whic...
متن کاملAdditive Distances and Quasi-Distances Between Words
We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-preserving, that is, the neighborhood of any radius of a regular language with respect to an additive quasi-distance is regular. Finally, similar results will be proven for context-free, computable and computably enumerable...
متن کاملResolving and classifying haematopoietic bone-marrow cell populations by multi-dimensional analysis of flow-cytometry data.
The study of normal or malignant haematopoiesis requires the analysis of heterogeneous cell populations using multiple morphological and molecular criteria. Flow cytometry has the capacity to acquire multi-parameter information of large haematopoietic cell populations, utilizing various combinations of >200 molecular markers (clusters of differentiation, CD). However, current flow cytometry ana...
متن کاملClassifying Relationships Between Nouns
In this paper we develop a system for classifying relationships between noun pairs. This is accomplished by finding the dependency paths between the nouns in the Reuters corpus and training a multiclass classifier based on the counts of the paths. We experiment with several classification algorithms (NB, kNN, SVM), feature selection techniques, and additional features. The resulting system achi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Applications of Graphs
سال: 2016
ISSN: 2470-9859
DOI: 10.20429/tag.2016.030107